Lattice Points, Dedekind Sums, and Ehrhart Polynomials of Lattice Polyhedra
نویسندگان
چکیده
Let σ be a simplex of RN with vertices in the integral lattice ZN . The number of lattice points of mσ (= {mα : α ∈ σ}) is a polynomial function L(σ,m) of m ≥ 0. In this paper we present: (i) a formula for the coefficients of the polynomial L(σ, t) in terms of the elementary symmetric functions; (ii) a hyperbolic cotangent expression for the generating functions of the sequence L(σ,m), m ≥ 0; (iii) an explicit formula for the coefficients of the polynomial L(σ, t) in terms of torsion. As an application of (i), the coefficient for the lattice n-simplex of Rn with the vertices (0, . . . , 0, aj , 0, . . . , 0) (1 ≤ j ≤ n) plus the origin is explicitly expressed in terms of Dedekind sums; and when n = 2, it reduces to the reciprocity law about Dedekind sums. The whole exposition is elementary and self-contained.
منابع مشابه
An Algorithmic Theory of Lattice Points in Polyhedra
We discuss topics related to lattice points in rational polyhedra, including efficient enumeration of lattice points, “short” generating functions for lattice points in rational polyhedra, relations to classical and higher-dimensional Dedekind sums, complexity of the Presburger arithmetic, efficient computations with rational functions, and others. Although the main slant is algorithmic, struct...
متن کاملLower bounds on the coefficients of Ehrhart polynomials
We present lower bounds for the coefficients of Ehrhart polynomials of convex lattice polytopes in terms of their volume. We also introduce two formulas for calculating the Ehrhart series of a kind of a ”weak” free sum of two lattice polytopes and of integral dilates of a polytope. As an application of these formulas we show that Hibi’s lower bound on the coefficients of the Ehrhart series is n...
متن کاملNotes on the Roots of Ehrhart Polynomials
We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n , where n is the dimension. This improves on the previously best known bound n and complements a recent result of Braun [8] where it is shown that the norm of a root of a Ehrhart po...
متن کاملOn Ehrhart Polynomials of Lattice Triangles
The Ehrhart polynomial of a lattice polygon P is completely determined by the pair (b(P ), i(P )) where b(P ) equals the number of lattice points on the boundary and i(P ) equals the number of interior lattice points. All possible pairs (b(P ), i(P )) are completely described by a theorem due to Scott. In this note, we describe the shape of the set of pairs (b(T ), i(T )) for lattice triangles ...
متن کاملq-analogues of Ehrhart polynomials
One considers weighted sums over points of lattice polytopes, where the weight of a point v is the monomial q for some linear form λ. One proposes a q-analogue of the classical theory of Ehrhart series and Ehrhart polynomials, including Ehrhart reciprocity and involving evaluation at the q-integers.
متن کامل